Set-theoretic generation of ideals
نویسندگان
چکیده
منابع مشابه
Set-theoretic generation of ideals
© Mémoires de la S. M. F., 1989, tous droits réservés. L’accès aux archives de la revue « Mémoires de la S. M. F. » (http:// smf.emath.fr/Publications/Memoires/Presentation.html) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impress...
متن کاملNew Classes of Set-theoretic Complete Intersection Monomial Ideals
Let ∆ be a simplicial complex and χ be an s-coloring of ∆. Biermann and Van Tuyl have introduced the simplicial complex ∆χ. As a corollary of Theorems 5 and 7 in their 2013 article, we obtain that the Stanley–Reisner ring of ∆χ over a field is Cohen–Macaulay. In this note, we generalize this corollary by proving that the Stanley–Reisner ideal of ∆χ over a field is set-theoretic complete interse...
متن کاملThe Stanley-Reisner ideals of polygons as set-theoretic complete intersections
We show that the Stanley-Reisner ideal of the one-dimensional simplicial complex whose diagram is an n-gon is always a set-theoretic complete intersection in any positive characteristic.
متن کاملIDEALS OF PSEUDO MV-ALGEBRAS BASED ON VAGUE SET THEORY
The notion of vague ideals in pseudo MV-algebras is introduced,and several properties are investigated. Conditions for a vague set to be avague ideal are provided. Conditions for a vague ideal to be implicative aregiven. Characterizations of (implicative, prime) vague ideals are discussed.The smallest vague ideal containing a given vague set is established. Primeand implicative extension proper...
متن کاملRecognizing Graph Theoretic Properties with Polynomial Ideals
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mémoires de la Société mathématique de France
سال: 1989
ISSN: 0249-633X,2275-3230
DOI: 10.24033/msmf.344